Parallel Haskell implementations of theN-body problem
نویسندگان
چکیده
منابع مشابه
Parallel Haskell implementations of the N-body problem
This paper provides an assessment of high-level parallel programming models for multi-core programming by implementing two versions of the n-body problem. We compare three different parallel programming models based on parallel Haskell, differing in the ways how potential parallelism is identified and managed. We assess the performance of each implementation, discuss the sequential and parallel...
متن کاملEfficient Parallel Implementations of Multipole Based N-Body Algorithms
N-body problems pervade many different branches of numerical simulation. While the exact computation of the pairwise interactions between all N components of such a system is O(N) in complexity, approximate solutions often may be computed with O(N log N) or O(N) complexity. This work presents an original design and implementation of a parallel, multipole-based N-body algorithm for particle simu...
متن کاملDynamic Programming Parallel Implementations for the Knapsack Problem Dynamic Programming Parallel Implementations for the Knapsack Problem Soumis a La Revue Journal of Parallel and Distributed Computers Dynamic Programming Parallel Implementations for the Knapsack Problem
A systolic algorithm for the dynamic programming approach to the knapsack problem is presented. The algorithm can run on any number of processors and has optimal time speedup and processor eeciency. The running time of the algorithm is (mc=q + m) on a ring of q processors, where c is the knapsack size and m is the number of object types. A new procedure for the backtracking phase of the algorit...
متن کاملParallel Haskell ( Preliminary Draft )
MPP Haskell is a parallel implementation of the Haskell functional language for the Thinking Machines Inc. CM-5 large-scale distributed-memory multiprocessor. MPP Haskell is a derivative of GUM, a message-based parallel implementation of Haskell. GUM was carefully designed to minimise performance loss from low-bandwidth and high-latency communications; as an apparent consequence MPP Haskell, wi...
متن کاملParallel heuristic search in Haskell
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms, the standard Davis Putnam algorithm (DP); and the same algorithm extended with conflict-directed backjumping (CBJ). Encouraging preliminary results for the GpH parallel dialect of the non-strict functional programming languag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concurrency and Computation: Practice and Experience
سال: 2013
ISSN: 1532-0626
DOI: 10.1002/cpe.3087